Recurrence relations in a modular representation algebra
نویسندگان
چکیده
منابع مشابه
THE DUALITY OF THE L?-REPRESENTATION ALGEBRA ?(S ) OF A FOUNDATION SEMIGROUP S AND FUNCTION ALGEBRAS
In the present paper for a large family of topological semigroups, namely foundation semigroups, for which topological groups and discrete semigroups are elementary examples, it is shown that ?(S) is the dual of a function algebra.
متن کامل( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملGenerating Relations of Hermite–tricomi Functions Using a Representation of Lie Algebra
Motivated by recent studies of the properties of new classes of polynomials constructed in terms of quasi-monomials, certain generating relations involving Hermite–Tricomi functions are obtained. To accomplish this we use the representation Q(w,m0) of the 3-dimensional Lie algebra T3. Some special cases are also discussed. 2000 Mathematics Subject Classification: 33C45, 33C50, 33C80.
متن کاملRepresentation of IS-A relations
Generalization/specialization hierarchies (IS-A relations for short) are basic semantic constructs proposed in most information system conceptual models. At the other side of design methodologies, where standard DBMSs are used, and will still be used for several tears, there is no explicit representation of these IS-A relations. As a consequence, all the current methodologies include a step thr...
متن کاملModular Arithmetic and Elementary Algebra
where z is an integer then gcd(a, b) = gcd(b, c). Indeed any divisor of a and b will divide c, and conversely any divisor of b and c will divide a. We can compute c by taking the remainder after dividing a by b, i.e. c is a mod b. (We will discuss the mod operation in greater details in the next section, but at this point, we only need the definition of c as the remainder of dividing a by b.) B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1982
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700005712